分数扩散模型的参数估计及其应用

研究分数扩散模型的参数估计及其应用问题.分数扩散模型是一类由分数Brownian运动驱动的随机微分方程.主要结果有:(1)利用二次变差方法给出模型中扩散系数的估计量,通过最小二乘法给出模型中漂移系数的估计量;(2)证明这些估计量的一致收敛性和渐近正态性;(3)利用MCMC方法对此估计量进行验证,并通过R软件将上述模型以及参数估计量应用到SHIBOR利率中进行实证研究.     

һ��Coxģ�Ͳ����ľ���Bayes��˫�����

In this paper, the empirical Bayes (EB) two-sided test for parameter of Cox models is investigated under square loss functions. At first by using recursive kernel estimation of probability function the empirical Bayes two-sided test rule is constructed. It proves that the proposed empirical Bayes test rule is asymptotic optimal and convergence rates are obtained under suitable conditions. Finally an example of satisfying theorem conditions is given.     

非线性半定规划的逐次线性化柔性惩罚法

针对非线性不等式约束半定规划问题提出一种新的逐次线性化方法, 新算法既不要求罚函数单调下降, 也不使用过滤技巧, 尝试步的接受准则仅仅依赖于目标函数和约束违反度, 罚函数中对应于成功迭代点的罚因子不需要单调增加. 新算法或者要求违反约束度量有足够改善, 或者在约束违反度的一个合理范围内要求目标函数值充分下降, 在通常假设条件下, 分析了新算法的适定性及全局收敛性. 最后, 给出了非线性半定规划问题的数值试验结果, 结果表明了新算法的有效性.     

The cut‐tree of large trees with small heights

We destroy a finite tree of size n by cutting its edges one after the other and in uniform random order. Informally, the associated cut‐tree describes the genealogy of the connected components created by this destruction process. We provide a general criterion for the convergence of the rescaled cut‐tree in the Gromov‐Prohorov topology to an interval endowed with the Euclidean distance and a certain probability measure, when the underlying tree has branching points close to the root and height of order . In particular, we consider uniform random recursive trees, binary search trees, scale‐free random trees and a mixture of regular trees. This yields extensions of a result in Bertoin (Probab Stat 5 (2015), 478–488) for the cut‐tree of uniform random recursive trees and also allows us to generalize some results of Kuba and Panholzer (Online J Anal Combin (2014), 26) on the multiple isolation of vertices. The approach relies in the close relationship between the destruction process and Bernoulli bond percolation, which may be useful for studying the cut‐tree of other classes of trees. © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 404–427, 2017     

A nonstandard finite difference method for solving a mathematical model of HIV-TB co-infection

We design and analyze an unconditionally convergent nonstandard finite-difference method to study transmission dynamics of a mathematical model of HIV-TB co-infection. The dynamics of this model are studied using the qualitative theory of dynamical systems. These qualitative features of the continuous model are preserved by the numerical method that we propose in this paper. This method also preserves positivity of the solution which is one of the essential requirements when modelling epidemic diseases. Furthermore, we show that the numerical method is unconditionally stable. Competitive numerical results confirming theoretical investigations are provided. Comparisons are also made with other conventional approaches that are routinely used to solve these types of problems.     

Convergent sequences of sparse graphs: A large deviations approach

Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on and . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017     

一类奇异非线性多重调和方程存在正整解的充分必要条件

研究一类奇异非线性多重调和方程?~mu=f(|x|,u,|▽u|)u~(-β),给出了方程存在正的径向对称整体解的充分必要条件和解的性质.     

NA随机变量阵列的完全矩收敛性

利用NA随机变量的矩不等式和截尾方法,研究了NA随机变量阵列的完全矩收敛性,给出了证明NA随机变量阵列完全矩收敛性的一些充分条件.所得结果推广了已有文献关于NA随机变量的相应结果.     

An analysis on the efficiency of Euler's method for computing the matrix pth root

It is shown that the matrix sequence generated by Euler's method starting from the identity matrix converges to the principal pth root of a square matrix, if all the eigenvalues of the matrix are in a region including the one for Newton's method given by Guo in 2010. The convergence is cubic if the matrix is invertible. A modification version of Euler's method using the Schur decomposition is developed. Numerical experiments show that the modified algorithm has the overall good numerical behavior.     

On Moments of Folded and Truncated Multivariate Normal Distributions

Recurrence relations for integrals that involve the density of multivariate normal distributions are developed. These recursions allow fast computation of the moments of folded and truncated multivariate normal distributions. Besides being numerically efficient, the proposed recursions also allow us to obtain explicit expressions of low-order moments of folded and truncated multivariate normal distributions. Supplementary material for this article is available online.